combinatorial optimization problem造句
例句与造句
- A novel algorithm and its convergence for a class of combinatorial optimization problems
一类组合优化问题的新解法及其收敛性 - This paper studies the approximation algorithms of some combinatorial optimization problems
本文主要研究组合优化中若干问题的近似算法。 - In addition , simulated annealing algorithm for the combinatorial optimization problem here is also given
此外，利用模拟退火算法成功地解决了该组合优化问题。 - Packing problems are categorized as discrete combinatorial optimization problems with np - complete computational complexities
布局问题是具有np完备计算复杂度的离散组合优化问题。 - Grouping problem is combinatorial optimization problem which is effective to solve by genetic algorithm
成组技术问题是组合优化问题,而遗传算法正是目前求解组合最优化的有效方法之一。 - It's difficult to find combinatorial optimization problem in a sentence. 用combinatorial optimization problem造句挺难的
- The cast grouping and ordering problem of steelmaking continuous casting hot rolling ( sm - cc ) is a combinatorial optimization problem
摘要炼钢-连铸生产的浇次组合与排序是带有工艺约束的并行机流水车间调度问题。 - The optimization of gear parameters in designing movements of clocks and watches is a combinatorial optimization problem . it is difficult to solve the problem
钟手表机芯设计中齿轮参数的优化设计问题是一个组合优化问题,很难用传统优化方法解决。 - Scheduling is one kind of important combinatorial optimization problem , which use some processors , machines or resources to accomplish optimally a batch of given tasks or jobs
排序问题研究的是若干个任务要在一些机器上进行加工，如何安排机器和任务使得某些要求(目标函数)达到最优的问题。 - Recently , genetic algorithm has been tyied to resolve variable combinatorial optimization problems , such as job scheduling problem , but but has began just now in vsp
近些年来，人们在用遗传算法解决现实中的各种组合优化问题上进行了探索，如在生产调度问题中的应用，但在车辆调度问题中的应用才刚刚开始。 - In the rest of the thesis , we study approximation algorithms with their worst - case analysis for four different combinatorial optimization problems . in chapter 2 , we consider the optimization versions of the 3 - partitioning and the kernel 3 - partitioning problems
在第二章至第五章中，我们分别研究了四个组合优化问题的近似算法，并给出了它们的性能分析。 - Ant colony optimization ( aco ) algorithm is a nature - inspired metaheuristic algorithm . it has experienced more than 10 years ’ development since it was proposed and has become an efficient tool for solving combinatorial optimization problem
蚁群优化算法是一种基于自然启发的metaheuristic算法,从其提出到现在历经10多年的发展到目前已经成为一种解决组合优化问题的有效工具。 - Dp technique is a high efficiency algorithm to solve combinatorial optimization problems by divided the multidimensional problem into multiple 1 - dimension problems . when this technique resorts to accumulate multiple frames , there are some disadvantages
动态规划算法是一种解决组合寻优问题的高效算法,通过将n维问题变换为n个一维优化问题,一个一个地求解的方法,很好的提高了效率。 - The maximum clique problem ( mcp ) is a classical combinatorial optimization problem which belongs to np - hard , and many practical problems can be formulated to it . therefore , studying the mcp is full of significance both in theory and in practice
最大团问题是一个经典的np难的组合优化问题,很多实际问题都可以抽象为对无向图上最大团问题的求解,所以,对最大团问题的研究无论在理论上还是实际上都有重要意义。 - To solve the combinatorial optimization problem of outer layout and inner connection integrated schemes in the design of hydraulic manifold blocks ( hmb ) , an intelligent virtual design method was proposed with combining modern intelligent optimization methods with virtual design technology
摘要为解决液压集成块设计中外部布局和内部布孔集成的组合优化问题，提出了一种融合现代智能优化方法和虚拟设计技术的智能虚拟设计方法。 - Ant colony algorithm is a novel simulated evolutionary algorithm , which is used to solve the optimization problems through simulating the way of ants finding the shortest path for food . this algorithm has been applied successfully to combinatorial optimization problems such as traveling salesman problem
蚁群算法是一种新型的模拟进化算法，它通过模拟蚁群在觅食过程中寻找最短路径的方法来求解优化问题，目前在旅行商问题等组合优化问题中有成功的应用。
更多例句： 下一页